منابع مشابه
Hamiltonian index is NP-complete
In this paper we show that the problem to decide whether the hamiltonian index of a given graph is less or equal to a given constant is Research supported by grants No. 1M0545 and MSM 4977751301 of the Czech Ministry of Education. Supported by Nature Science Funds of China under Contract Grant No.: 10671014
متن کاملFinding Hamiltonian Cycles in Delaunay Triangulations Is NP-complete
It is shown that it is an NP-complete problem to determine whether a Delaunay trian-gulation or an inscribable polyhedron has a Hamiltonian cycle. It is also shown that there exist nondegenerate Delaunay triangulations and simplicial, inscribable polyhedra without 2-factors. Irvine through an allocation of computer resources.
متن کاملOverloading is NP - complete
We show that overloading is NP-complete. This solves exercise 6.25 in the 1986 version of the Dragon book.
متن کاملMastermind is NP-Complete
In this paper we show that the Mastermind Satisfiability Problem (MSP) is NPcomplete. Mastermind is a popular game which can be turned into a logical puzzle called the Mastermind Satisfiability Problem in a similar spirit to the Minesweeper puzzle [5]. By proving that MSP is NP-complete, we reveal its intrinsic computational property that makes it challenging and interesting. This serves as an ...
متن کاملBLOCKSUM is NP-Complete
SUMMARY BlockSum, also known as KeisanBlock in Japanese, is a Latin square filling type puzzle, such as Sudoku. In this paper, we prove that the decision problem whether a given instance of BlockSum has a solution or not is NP-complete.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2011
ISSN: 0166-218X
DOI: 10.1016/j.dam.2010.08.027